Triangles in a complete chromatic graph with three colorsGOODMAN, A. W.Discrete mathematics. 1985, Vol 57, Num 3, pp 225-235, issn 0012-365XArticle

RECENT RESULTS ON CHROMATICALLY EQUIVALENT GRAPHSBARI RA.1979; ANN. NEW YORK ACAD. SCI.; USA; DA. 1979-05; VOL. 319; PP. 37-46; BIBL. 3 REF.Conference Paper

SOME RESULTS OF CHROMATIC HYPERGRAPH THEORY PROVED BY REDUCTION TO GRAPHSJONES RP.1978; PROBLEMES COMBINATOIRES ET THEORIE DES GRAPHES. CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE. COLLOQUE INTERNATIONAL. 260/1976/ORSAY; FRA; PARIS: CNRS; DA. 1978; PP. 249-250; ABS. FRE; BIBL. 6 REF.Conference Paper

Graph properties and hypergraph colouringsBROWN, J. I; CORNEIL, D. G.Discrete mathematics. 1991, Vol 98, Num 2, pp 81-93, issn 0012-365XArticle

On generalized graph coloringsBROWN, J. I; CORNEIL, D. G.Journal of graph theory. 1987, Vol 11, Num 1, pp 87-99, issn 0364-9024Article

A characterization of absolute retracts of n-chromatic graphsPESCH, E; POGUNTKE, W.Discrete mathematics. 1985, Vol 57, Num 1-2, pp 99-104, issn 0012-365XArticle

Bichromaticity of bipartite graphsPRITIKIN, D.Journal of graph theory. 1985, Vol 9, Num 4, pp 497-502, issn 0364-9024Article

ON 3-CHROMATIC HYPERGRAPHSBECK J.1978; DISCRETE MATH.; NLD; DA. 1978; VOL. 24; NO 2; PP. 127-137; BIBL. 4 REF.Article

The categorical product of two 5-chromatic digraphs can be 3-chromaticBESSY, Stéphane; THOMASSE, Stéphan.Discrete mathematics. 2005, Vol 305, Num 1-3, pp 344-346, issn 0012-365X, 3 p.Article

A color problem for fuzzy graphBERSHTEIN, Leonid; BOZHENUK, Alexander.Lecture notes in computer science. 2001, pp 500-505, issn 0302-9743, isbn 3-540-42732-5Conference Paper

Chromatically optimal rigid graphsNESETRIL, J; RODL, V.Journal of combinatorial theory. Series B. 1989, Vol 46, Num 2, pp 133-141, issn 0095-8956Article

On the average Steiner distance of graphs with prescribed propertiesDANKELMANN, P; SWART, H. C; OELLERMANN, O. R et al.Discrete applied mathematics. 1997, Vol 79, Num 1-3, pp 91-103, issn 0166-218XArticle

Independent sets in k-chromatic graphsVOSS, H.-J.Combinatorica (Print). 1986, Vol 5, Num 3, pp 261-269, issn 0209-9683Article

A new approximation algorithm for the register allocation problemJANSEN, K; REITER, J.Lecture notes in computer science. 1997, pp 135-146, issn 0302-9743, isbn 3-540-63138-0Conference Paper

STILL ANOTHER TRIANGLE-FREE INFINITE-CHROMATIC GRAPHGYARFAS A.1980; DISCRETE MATH.; NLD; DA. 1980; VOL. 30; NO 2; PP. 185Article

On locally-perfect coloringsDUCHET, P.Discrete mathematics. 1989, Vol 74, Num 1-2, pp 29-32, issn 0012-365XArticle

A note on chromatic uniqueness of graphsCHIA, G. L.Journal of graph theory. 1986, Vol 10, Num 4, pp 541-543, issn 0364-9024Article

Dense graphs have K3,t minorsKOSTOCHKA, A. V; PRINCE, N.Discrete mathematics. 2010, Vol 310, Num 20, pp 2637-2654, issn 0012-365X, 18 p.Article

Cliques, minors and apex graphsJIANBING NIU; ZHANG, Cun-Quan.Discrete mathematics. 2009, Vol 309, Num 12, pp 4093-4105, issn 0012-365X, 13 p.Article

The two possible values of the chromatic number of a random graphACHLIOPTAS, Dimitris; NAOR, Assaf.Annals of mathematics. 2005, Vol 162, Num 3, pp 1335-1351, issn 0003-486X, 17 p.Article

Open colorings, the continuum and the second uncountable cardinalMOORE, Justin Tatch.Proceedings of the American Mathematical Society. 2002, Vol 130, Num 9, pp 2753-2759, issn 0002-9939Article

The minimum color sum of bipartite graphsBAR-NOY, A; KORTSARZ, G.Lecture notes in computer science. 1997, pp 738-748, issn 0302-9743, isbn 3-540-63165-8Conference Paper

An approach to Hedetniemi's conjectureSAUER, N. W; ZHU, X.Journal of graph theory. 1992, Vol 16, Num 5, pp 423-436, issn 0364-9024Article

Isomorphism of two infinite-chromatic triangle-free graphsTUZA, Z.Discrete mathematics. 1988, Vol 69, Num 1, issn 0012-365X, 95Article

Absolutely 3-chromatic graphsEVANS, A. B.Journal of graph theory. 1986, Vol 10, Num 4, pp 511-521, issn 0364-9024Article